A Dynamic Rationalization of Distance Rationalizability
نویسندگان
چکیده
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus distance function on preference profiles, rationalizable rule selects alternative that closest to being winner. Despite its appeal, faces the challenge connecting chosen measure operational social desirability. We tackle this issue via decision-theoretic framework dynamic choice, in which choice Markov decision process (MDP) models dynamics voter preferences response winner selection. show that, prominent class functions, one can construct MDP, with natural rewards, such (votewise) respect unanimity iff it (deterministic) optimal policy MDP. This provides rationale rationalizability, demonstrating equivalence rules static sense selection maximize societal utility process.
منابع مشابه
A Dynamic Rationalization of Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...
متن کاملRationalizing Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...
متن کاملDistance rationalization of social rules
The concept of distance rationalizability of social choice rules has been explored in recent years by several authors. We deal here with several foundational questions, and unify, correct, and generalize previous work. For example, we study a new question involving uniqueness of representation in the distance rationalizability framework, and present a counterexample. For rules satisfying variou...
متن کاملBurak Can Distance rationalizability of scoring rules RM/13/028 Distance Rationalizability of Scoring Rules
Collective decision making problems can be seen as finding an outcome that is “closest” to a concept of “consensus”. Nitzan (1981) introduced “Closeness to Unanimity Procedure” as a first example to this approach and showed that the Borda rule is the closest to unanimity under swap distance (a.k.a the Kemeny (1959) distance). Meskanen and Nurmi (2008) shows that the Dodgson rule is the closest ...
متن کاملDistance rationalization of voting rules
The concept of distance rationalizability allows one to define new voting rules or rationalize existing ones via a consensus, i.e., a class of elections that have a unique, indisputable winner, and a distance over elections: A candidate is declared an election winner if she is the consensus candidate in one of the nearest consensus elections. Many classic voting rules are defined or can be repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v26i1.8240